A “very noisy≓ channel is defined. This definition corresponds to many physical channels operating at low signal-to-noise ratio. For “very noisy≓ discrete input memoryless channels, the computation cutoff rate for sequential decoding, Rcomp, is shown to be one-half the capacity, C. Furthermore, that choice of input probabilities which achieves C also maximizes Rcomp, and vice versa.*Operated with support from the United States Army, Navy, and Air Force
We introduce Noise Recycling, a method that enhances decoding performance of channels subject to cor...
We begin a systematic study of the problem of the zero-error capacity of noisy binary channels with ...
Noisy channels are a valuable resource from a cryptographic point of view. They can be used for exch...
A “very noisy≓ channel is defined. This definition corresponds to many physical channels operating a...
"September 20, 1957." "Reprinted from the 1957 IRE Wescon convention record, part 2."Bibliography: p...
In this paper we will develop certain extensions and refinements of coding theory for noisy communic...
Based on a Ph.D. thesis in the Dept. of Electrical Engineering, 1967.Bibliography: p. 115
Channel capacity of a discrete channel is evaluated for a number of tactical situations involving an...
[[abstract]]Summary form only given. At low signal-to-noise ratio, the geometric structure of a code...
© 2016 IEEE. This paper considers the problem of communication over a discrete memoryless channel (D...
Summary form only given. Two coding algorithms for discrete noiseless channels with input constraint...
© 2018 IEEE. We introduce a new algorithm for Maximum Likelihood (ML) decoding for channels with mem...
In information theory, Shannon’s Noisy-Channel Coding Theorem states that it is possible to communic...
Abstract—This paper investigates the behavior of the noisy Min-Sum decoder over binary symmetric cha...
New lower bounds are presented for the minimum error probability that can be achieved through the us...
We introduce Noise Recycling, a method that enhances decoding performance of channels subject to cor...
We begin a systematic study of the problem of the zero-error capacity of noisy binary channels with ...
Noisy channels are a valuable resource from a cryptographic point of view. They can be used for exch...
A “very noisy≓ channel is defined. This definition corresponds to many physical channels operating a...
"September 20, 1957." "Reprinted from the 1957 IRE Wescon convention record, part 2."Bibliography: p...
In this paper we will develop certain extensions and refinements of coding theory for noisy communic...
Based on a Ph.D. thesis in the Dept. of Electrical Engineering, 1967.Bibliography: p. 115
Channel capacity of a discrete channel is evaluated for a number of tactical situations involving an...
[[abstract]]Summary form only given. At low signal-to-noise ratio, the geometric structure of a code...
© 2016 IEEE. This paper considers the problem of communication over a discrete memoryless channel (D...
Summary form only given. Two coding algorithms for discrete noiseless channels with input constraint...
© 2018 IEEE. We introduce a new algorithm for Maximum Likelihood (ML) decoding for channels with mem...
In information theory, Shannon’s Noisy-Channel Coding Theorem states that it is possible to communic...
Abstract—This paper investigates the behavior of the noisy Min-Sum decoder over binary symmetric cha...
New lower bounds are presented for the minimum error probability that can be achieved through the us...
We introduce Noise Recycling, a method that enhances decoding performance of channels subject to cor...
We begin a systematic study of the problem of the zero-error capacity of noisy binary channels with ...
Noisy channels are a valuable resource from a cryptographic point of view. They can be used for exch...
DOI
Add to ORKG